A Resolution Procedure for Description Logics with Nominal Schemas
نویسندگان
چکیده
We present a polynomial resolution-based decision procedure for the recently introduced description logic ELHOVn(u) , which features nominal schemas as new language construct. Our algorithm is based on ordered resolution and positive superposition, together with a lifting lemma. In contrast to previous work on resolution for description logics, we have to overcome the fact that ELHOVn(u) does not allow for a normalization resulting in clauses of globally limited size.
منابع مشابه
A Resolution Procedure for Description Logics with Nominal Schema
We present a polynomial resolution-based decision procedure for the recently introduced description logic ELHOVn(u) , which features nominal schemas as new language construct. Our algorithm is based on ordered resolution and positive superposition, together with a lifting lemma. In contrast to previous work on resolution for description logics, we have to overcome the fact that ELHOVn(u) does n...
متن کاملNominal Schemas for Integrating Rules and Description Logics
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rules in description logic syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal...
متن کاملTowards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas
Extending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms. However, establishing efficient algorithms for reasoning with nominal schemas has so far been a challenge. In this paper, we present an algorithm to reason with the description logic fragment ELROVn, a fragment that extends EL with nominal sc...
متن کاملSROIQ Syntax Approximation by Using Nominal Schemas
Nominal schemas is a recently introduced extension of description logics which makes it possible to express rules which generalize DL-safe ones. A tractable description logic, ELROVn, has been identified. This leads us to the question: can we improve approximate reasoning results by employing nominal schemas? In this paper, we investigate how to approximately cast SROIQ into ELROVn. Using a dat...
متن کاملComplexities of Nominal Schemas
In this extended abstract, we review our recent work “Nominal Schemas in Description Logics: Complexities Clarified” [6], to be presented at KR 2014. The fruitful integration of reasoning on both schema and instance level poses a continued challenge to knowledge representation and reasoning. While description logics (DLs) excel at the former task, rule-based formalisms are often more adequate f...
متن کامل